A new representation of generalized averaged Gauss quadrature rules
نویسندگان
چکیده
Gauss quadrature rules associated with a nonnegative measure support on (part of) the real axis find many applications in Scientific Computing. It is important to be able estimate error when replacing an integral by ℓ-node rule order choose suitable number of nodes. A classical approach this evaluate (2ℓ+1)-node Gauss–Kronrod rule. However, 2ℓ+1 nodes might not exist. The generalized averaged formula described Spalević (2007) [16] guaranteed exist and provides attractive alternative This paper describes new representation formulas that cheaper than available representation.
منابع مشابه
Truncated generalized averaged Gauss quadrature rules
Generalized averaged Gaussian quadrature formulas may yield higher accuracy than Gauss quadrature formulas that use the same moment information. This makes them attractive to use when moments or modified moments are cumbersome to evaluate. However, generalized averaged Gaussian quadrature formulas may have nodes outside the convex hull of the support of the measure defining the associated Gauss...
متن کاملGeneralized averaged Szegő quadrature rules
Szegő quadrature rules are commonly applied to integrate periodic functions on the unit circle in the complex plane. However, often it is difficult to determine the quadrature error. Recently, Spalević introduced generalized averaged Gauss quadrature rules for estimating the quadrature error obtained when applying Gauss quadrature over an interval on the real axis. We describe analogous quadrat...
متن کاملGeneralized anti-Gauss quadrature rules
Abstract. Gauss quadrature is a popular approach to approximate the value of a desired integral determined by a measure with support on the real axis. Laurie proposed an (n+1)-point quadrature rule that gives an error of the same magnitude and of opposite sign as the associated n-point Gauss quadrature rule for all polynomials of degree up to 2n + 1. This rule is referred to as an anti-Gauss ru...
متن کاملGeneralized averaged Gauss quadrature rules for the approximation of matrix functionals
The need to compute expressions of the form uf(A)v, where A is a large square matrix, u and v are vectors, and f is a function, arises in many applications, including network analysis, quantum chromodynamics, and the solution of linear discrete ill-posed problems. Commonly used approaches first reduce A to a small matrix by a few steps of the Hermitian or non-Hermitian Lanczos processes and the...
متن کاملCalculation of Gauss Quadrature Rules
Several algorithms are given and compared for computing Gauss quadrature rules. It is shown that given the three term recurrence relation for the orthogonal polynomials generated by the weight function, the quadrature rule may be generated by computing the eigenvalues and first component of the orthornormalized eigenvectors of a symmetric tridiagonal matrix. An algorithm is also presented for c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Numerical Mathematics
سال: 2021
ISSN: ['1873-5460', '0168-9274']
DOI: https://doi.org/10.1016/j.apnum.2020.11.016